Generalized TCP congestion avoidance and its effect on bandwidth sharing and variability

To model possible suggested changes in TCP window adap tation in response to randomized feedback, such as ECN, we formulate a generalized verslon of the TCP congestion avoidance algorithm. We first consider multiple such generalized TCP flows sharing a bottleneck Mer under the Assured Service model and use a Rxed point technique to obtain the mean window sizes and throughputs for the TCP flows. To further study how changes in the adaptation algorithm affect the variability in the throughput, we use an analytical-eum-numerical technique to derive the window distribution (and related statistics) of a single generalized flow under state-dependent randomized congestion feedback.